1·Using ant colony algorithm to solve 0-1 knapsack problem.
用蚁群算法解决0-1背包问题。
2·This is about 01 knapsack problem dynamic programming algorithm.
这是关于01背包问题的动态规划算法。
3·Particle Swarm Optimism; Knapsack Problem; genetic probability;
粒子群优化算法； 背包问题； 遗传概率；
4·Trial designed recursive algorithm for solving knapsack problem.
试用递归方法设计求解背包问题的算法。
5·With the continuous knapsack problem as we've formulated it, greedy is good.
因为正如我们已经归越过的，对于一般连续性背包问题贪婪算法很实用。
6·The solution process is described with the solution of 0/1 knapsack problem.
结合0 / 1背包问题的求解，阐明这种方法求解问题的过程。
7·The function optimization and knapsack problem show the effectiveness of PEA.
函数优化和背包问题实验验证了PEA的有效性。
8·So we'll start looking in detail at one problem, and that's the knapsack problem. Let's see.
让我们开始仔细讲讲一个问题，那就是背包问题。
9·In theory, the layout problem of storage space can be interpreted as a knapsack problem.
从理论上讲，仓储空间布局问题可以理解为背包问题。
10·This paper proposes a rigorous algorithm for solving the 0-1 polynomial knapsack problem.
提出了0-1多项式背包问题的一种新的精确算法。